Efficient Bit-Parallel Systolic Polynomial Basis Multiplier over GF(28) based on Irreducible Polynomials
نویسندگان
چکیده
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملEfficient Bit - Parallel Systolic Multiplier over GF ( 2 m )
A bit parallel systolic multiplier in the finite field GF(2) over the polynomial basis where irreducible polynomial generate the field GF(2) is presented. The complexity of the proposed multiplier is compared in terms of area, latency and speed. The proposed multiplier has high throughput as compared with the traditional systolic multiplier. Moreover, this multiplier is highly regular, modular,...
متن کاملGF(2) Based Polynomials Multiplier Using An Efficient Systolic Multiplier
This paper presents an area-time-efficient systolic structure for multiplication over GF(2 m ) based on irreducible all-one polynomial (AOP). A novel cut-set retiming to reduce the duration of the critical-path to one XOR gate delay is used. Also the systolic structure can be decomposed into two or more parallel systolic branches, where the pair of parallel systolic branches has the same input ...
متن کاملLow space complexity CRT-based bit-parallel GF(2n) polynomial basis multipliers for irreducible trinomials
By selecting the largest possible value of k ∈ (n/2, 2n/3], we further reduce the AND and XOR gate complexities of the CRT-based hybrid parallel GF (2) polynomial basis multipliers for the irreducible trinomial f = u + u + 1 over GF (2): they are always less than those of the current fastest parallel multipliers – quadratic multipliers, i.e., n AND gates and n− 1 XOR gates. Our experimental res...
متن کاملGF(2n) Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials
Introduction: Squarer is an important circuit building block in squareand-multiply-based exponentiation and inversion circuits. When GF (2n) elements are represented in a normal basis, squaring is simply a circular shift operation. Therefore, most previous works on squarers focused on other representations of GF (2n) elements. For practical applications where values of n are often in the range ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9is1/107827